منابع مشابه
Recursion Theory and Symbolic Dynamics
A set P ⊆ {0,1}N may be viewed as a mass problem, i.e., a decision problem with more than one solution. By definition, the solutions of P are the elements of P . A mass problem is said to be solvable if at least one of its solutions is recursive. A mass problem P is said to be Muchnik reducible to a mass problem Q if for each solution of Q there exists a solution of P which is Turing reducible ...
متن کاملAutomata Theory and Symbolic Dynamics Workshop
We consider the following question: what is the least biased stochastic process over the runs of a given timed automaton? By “least biased”, we mean the one that generates runs with a distribution which is closest to uniform (w.r.t. volume). To answer this question, we first define stochastic processes over runs of timed automata and their entropy, the definition of which is inspired by Shannon...
متن کاملFrom rate distortion theory to metric mean dimension: variational principle
The purpose of this paper is to point out a new connection between information theory and dynamical systems. In the information theory side, we consider rate distortion theory, which studies lossy data compression of stochastic processes under distortion constraints. In the dynamical systems side, we consider mean dimension theory, which studies how many parameters per second we need to describ...
متن کاملSymbolic Nearest Mean Classiiers
Piew Datta and Dennis Kibler Department of Information and Computer Science University of California Irvine, CA 92717 fpdatta, [email protected] Abstract The minimum-distance classi er summarizes each class with a prototype and then uses a nearest neighbor approach for classi cation. Three drawbacks of the minimum-distance classi er are its inability to work with symbolic attributes, weigh at...
متن کاملSymbolic Nearest Mean Classifiers
The minimum-distance classifier summarizes each class with a prototype and then uses a nearest neighbor approach for classification. Three drawbacks of the original minimum-distance classifier are its inability to work with symbolic attributes, weigh attributes, and learn more than a single prototype for each class. The proposed solutions to these problems include defining the mean for symbolic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ergodic Theory and Dynamical Systems
سال: 2020
ISSN: 0143-3857,1469-4417
DOI: 10.1017/etds.2020.47